منابع مشابه
The Common Prefix Problem On Trees
We present a theoretical study of a problem arising in database query optimization [1], which we call as The Common Prefix Problem. We present a (1 − o(1)) factor approximation algorithm for this problem, when the underlying graph is a binary tree. We then use a result of Feige and Kogan [2] to show that even on stars, the problem is hard to approximate.
متن کاملOn the Comparison Complexity of the String Prefix-Matching Problem
In this paper we study the exact comparison complexity of the string prefix-matching problem in the deterministic sequential comparison model with equality tests. We derive almost tight lower and upper bounds on the number of symbol comparisons required in the worst case by on-line prefix-matching algorithms for any fixed pattern and variable text. Unlike previous results on the comparison comp...
متن کاملPrefix search with a lie
The problem of performing a search procedure when some of the answers to queries may be erroneous has been recently investigated by many authors (see [3,4, 2, 11). One of the main questions in this domain was stated by S. M. Ulam [S]: what is the minimal number of yes-no queries sufficient to find an unknown object in an n-element set if at most one answer may be erroneous? This problem was fir...
متن کاملthe problem of divine hiddenness
این رساله به مساله احتجاب الهی و مشکلات برهان مبتنی بر این مساله میپردازد. مساله احتجاب الهی مساله ای به قدمت ادیان است که به طور خاصی در مورد ادیان ابراهیمی اهمیت پیدا میکند. در ادیان ابراهیمی با توجه به تعالی خداوند و در عین حال خالقیت و حضور او و سخن گفتن و ارتباط شهودی او با بعضی از انسانهای ساکن زمین مساله ای پدید میاید با پرسشهایی از قبیل اینکه چرا ارتباط مستقیم ویا حداقل ارتباط وافی به ب...
15 صفحه اولParallel computing using the prefix problem
Spend your time even for only few minutes to read a book. Reading a book will never reduce and waste your time to be useless. Reading, for some people become a need that is to do every day such as spending time for eating. Now, what about you? Do you like to read a book? Now, we will show you a new book enPDFd parallel computing using the prefix problem that can be a new way to explore the know...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.06.011